A Graph-Based Optimal On-Ramp Merging of Connected Vehicles on the Highway

Connected and automated vehicles (CAVs) are a very promising alternative for reducing fuel consumption improving traffic efficiency when merge at on-ramps. In this study, we propose graph-based method to coordinate CAVs the highway ramp. First, optimized were divided into groups pass merging point. Then built directed graph model each group of vehicles, where path corresponds one all possible sequences. The improved shortest algorithm is proposed find optimal sequence minimizing total consumption. results simulation showed that reduced ensured high efficiency; moreover, can form platoon after passing